Automated Experiments for Deriving Performance-relevant Properties of Software Execution Environments
نویسنده
چکیده
In software engineering, considering quality attributes such as software performance plays a crucial role. Approaches such as Software Performance Engineering (SPE) aim at systematically reflecting software performance during the whole software life-cycle. Using model-based performance analyses, predictions on the software performance, e.g. the expected software response times or the resource utilization, can already be conducted during design time. The software execution environment heavily influences the performance of a software and thus has to be reflected in performance analysis. With the increased complexity of the execution environment (e.g. due to the introduction of virtualized environments or new operating system schedulers), performance analysis approaches have to be extended in order to continue to yield precise prediction results. Existing performance prediction approaches usually abstract from most parts of the execution environment or do not deal with the problem of quantifying properties of the execution environment for performance prediction models. Hence, detecting execution environment properties and integrating such properties into performance analyses is a manual, error-prone task that requires expert knowledge on the execution environment. The scientific contribution of this thesis is a novel approach for detecting performance-relevant properties of the software execution environment. These properties are automatically detected using predefined experiments and integrated into performance prediction tools. To detect the properties, performance experiments are conducted on the target platform. The experiments issue predefined load patterns on the system and observe certain per-
منابع مشابه
An Evolutionary Method for Improving the Reliability of Safetycritical Robots against Soft Errors
Nowadays, Robots account for most part of our lives in such a way that it is impossible for usto do many of affairs without them. Increasingly, the application of robots is developing fastand their functions become more sensitive and complex. One of the important requirements ofRobot use is a reliable software operation. For enhancement of reliability, it is a necessity todesign the fault toler...
متن کاملModel-Based Control of Adaptive Applications: An Overview
Model-based control utilizes performance models of applications to choose performant system configurations for execution of applications. The performance models used in this research separate specification of the software system from specification of the execution environment so that model-based control can select software configurations for a given execution environment or, conversely, select ...
متن کاملModelling Layered Component Execution Environments for Performance Prediction
Software architects often use model-based techniques to analyse performance (e.g. response times), reliability and other extra-functional properties of software systems. These techniques operate on models of software architecture and execution environment, and are applied at design time for early evaluation of design alternatives, especially to avoid implementing systems with insufficient quali...
متن کاملFuzzy gain scheduling of PID controller for stiction compensation in pneumatic control valve
Inherent nonlinearities like, deadband, stiction and hysteresis in control valves degenerate plant performance. Valve stiction standouts as a more widely recognized reason for poor execution in control loops. Measurement of valve stiction is essential to maintain scheduling. For industrial scenarios, loss of execution due to nonlinearity in control valves is an imperative issue that should be t...
متن کاملState of the art: Dynamic symbolic execution for automated test generation
Dynamic symbolic execution for automated test generation consists of instrumenting and running a program while collecting path constraint on inputs from predicates encountered in branch instructions, and of deriving new inputs from a previous path constraint by an SMT (Satisfiability Modulo Theories) solver in order to steer next executions toward new program paths. It has been introduced into ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013